package cn.leetcode;

public class Code226 {

    public TreeNode invertTree(TreeNode root) {
        if(root == null){
            return null;
        }
        TreeNode treeNode1 = invertTree(root.left);
        root.left = invertTree(root.right);
        root.right = treeNode1;
        return root;
    }

}


